package com.haoyang.sort;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;

public class A01_BoubleSortDemo1 {
    public static void main(String[] args) {
        int[] arr = {2, 4, 5, 3, 1, 9,11,20,15};
        int[] resultArr = bouleSortAsc(arr);
        System.out.println(Arrays.toString(resultArr));

//        for (int i : resultArr) {
//            System.out.print(i + ", ");
//        }
    }

    private static int[] bouleSortAsc(int[] arr) {
        for (int i = 0; i < arr.length - 1 ; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }

        return arr;
    }


}
